Structured Strings
نویسنده
چکیده
Security problems like sql code injection and cross-site scripting vulnerabilities can be traced to the, common, use of unstructured strings to represent structured data and code. This paper gives an explanation of the issue, and develops and discusses an alternative generic encoding for structured string data that, by adding an appropriate, yet minimal layer of abstraction for meta-information, is very simple, and has the potential of immediately eliminating an entire attack vector.
منابع مشابه
CTS: An Interactive Technique for Manipulating Structured Text
This paper describes Complex Textual Strings (CTS), a technique for manipulating structured text strings and an underlying application data structure by creating a two-way mapping between the text and the data structure. An editable specification, called unification grammars describes ~e structure and data mapping characteristics of a particular Instance of CTS. We also describe an interpreter ...
متن کاملDesign Framework of a Database for Structured Documents with Object Links
Structured documents often contain character strings of which semantics can be naturally stored as database values or has direct correspondence with database values. By building bilateral logical links between character strings in documents and corresponding database values, semantically rich queries are made expressible. We have introduced a new ADT, named “paratext,” to model text which has l...
متن کاملSpace-efficient Data Structures for Collections of Textual Data
This thesis focuses on the design of succinct and compressed data structures for collections of string-based data, specifically sequences of semi-structured documents in textual format, sets of strings, and sequences of strings. The study of such collections is motivated by a large number of applications both in theory and practice. For textual semi-structured data, we introduce the concept of ...
متن کاملk-Valued Link Grammars are Learnable from Strings
The article is concerned with learning link grammars in the model of Gold. We show that rigid and k-valued link grammars are learnable from strings. In fact, we prove that the languages of link structured lists of words associated to rigid link grammars have finite elasticity and we show a learning algorithm. As a standard corollary, this result leads to the learnability of rigid or k-valued li...
متن کاملRapid Prototyping of a Structured Domain through Indexical Compilation
We report on our experience with rapid prototyping for a new structured domain of bounded-length strings, automatically generating propagator source code from an extended indexical specification.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007